#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=3e5+1000;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn];
LL l[maxn],r[maxn];
int main(void){
   	cin.tie(0);std::ios::sync_with_stdio(false);
    LL t;cin>>t;
    while(t--){
        LL n;cin>>n;
        for(LL i=1;i<=n;i++) cin>>a[i],l[i]=r[i]=0;
        LL all=0;
        for(LL i=1;i<=n;i++){
            if(!l[a[i]]) l[a[i]]=i,all++;
            r[a[i]]=max(r[a[i]],i);
        }
        LL cnt=0;
        LL last=0;
        LL res=0;
        for(LL i=1;i<=n;i++){
            if(!l[i]) continue;
            if(last<l[i]) cnt++;
            else cnt=1;
            last=r[i];
            res=max(res,cnt);
        }
        cout<<all-res<<"\n";
    }
   	return 0;
}
